Gillespie’s Stochastic Simulation Algorithm on MIC coprocessors
نویسندگان
چکیده
منابع مشابه
Study of parallel programming models on computer clusters with Intel MIC coprocessors
Coprocessors based on the Intel Many Integrated Core (MIC) Architecture have been adopted in many highperformance computer clusters. Typical parallel programming models, such as MPI and OpenMP, are supported on MIC processors to achieve the parallelism. In this work, we conduct a detailed study on the performance and scalability of the MIC processors under different programming models using the...
متن کاملParallel stochastic reaction-diffusion simulation using Gillespie stochastic simulation algorithm
Spatial stochastic simulation is a valuable method for studying processes of reaction and diffusion in biological systems. This technique requires significant computational efforts, but the availability of high-performance computing made it possible to develop coherent computational models of cells [1]. Several approaches were introduced in order to utilize parallel execution to speed up simula...
متن کاملAccelerating the Stochastic Simulation Algorithm
In order for scientists to learn more about molecular biology, it is imperative that they have the ability to construct accurate models that predict the reactions of species of molecules. Generating these models using deterministic approaches is not feasible as these models may violate some of the assumptions underlying classical differential equations models (e.g., small populations with discr...
متن کاملA retrodictive stochastic simulation algorithm
Article history: Received 7 August 2009 Received in revised form 4 December 2009 Accepted 20 January 2010 Available online 28 January 2010
متن کاملOn Parallelizing the MRRR Algorithm for Data-Parallel Coprocessors
The eigenvalues and eigenvectors of a symmetric matrix are needed in a myriad of applications in computational engineering and computational science. One of the fastest and most accurate eigensolvers is the Algorithm of Multiple Relatively Robust Representations (MRRR). This is the first stable algorithm that computes k eigenvalues and eigenvectors of a tridiagonal symmetric matrix in O(nk) tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Supercomputing
سال: 2016
ISSN: 0920-8542,1573-0484
DOI: 10.1007/s11227-016-1778-8